Convergence analysis of Lanczos-type methods for the linear response eigenvalue problem
نویسندگان
چکیده
Two different Lanczos-type methods for the linear response eigenvalue problem are analyzed. The first one is a natural extension of the classical Lanczos method for the symmetric eigenvalue problem while the second one was recently proposed by Tsiper specially for the linear response eigenvalue problem. Our analysis leads to bounds on errors for eigenvalue and eigenvector approximations by the twomethods. These bounds suggest that the first method can converge significantly faster than Tsiper’s method. Numerical examples are presented to support this claim. © 2013 Elsevier B.V. All rights reserved.
منابع مشابه
Sharpness in rates of convergence for the symmetric Lanczos method
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the rates of convergence good for a few extreme eigenpairs. These bounds suggest at least linear convergence in terms of the number of Lanczos steps, assuming there are gaps between individual eigenvalues. In practice, o...
متن کاملError Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
This paper presents an error analysis of the Lanczos algorithm in finite-precision arithmetic for solving the standard nonsymmetric eigenvalue problem, if no breakdown occurs. An analog of Paige's theory on the relationship between the loss of orthogonality among the Lanczos vectors and the convergence of Ritz values in the symmetric Lanczos algorithm is discussed. The theory developed illustra...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملA Case for a Biorthogonal Jacobi-Davidson Method: Restarting and Correction Equation
We propose a biorthogonal Jacobi-Davidson method (biJD), which can be viewed as an explicitly biorthogonalized, restarted Lanczos method, that uses the approximate solution of a correction equation to expand its basis. Through an elegant formulation, the algorithm allows for all the functionalities and features of the Jacobi-Davidson (JD), but it also includes some of the advantages of the nons...
متن کاملConvergence of Block Lanczos Method for Eigenvalue Clusters
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. It is well-known that the single-vector Lanczos method can only find one copy of any multiple eigenvalue. To compute all or some of the copies of a multiple eigenvalue, one has to use the block Lanczos method which is also known to compute clustered eigenvalues much faster than the single-vector La...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 247 شماره
صفحات -
تاریخ انتشار 2013